Computation paths logic: An expressive, yet elementary, process logic
نویسندگان
چکیده
منابع مشابه
Computation Paths Logic: An Expressive, yet Elementary, Process Logic
A new process logic is defined, called computation paths logic (CPL). which treats lbnn~~la~ and programs essentially alike. CPL is a pathwlse extension of PDL. following the basic pt-ocess logic of Harel. Kozen and Parikh. and is close in spirit to the logic R of Hare1 and Peleg. It enjoys most of the advantages of previous process logics. yet is decidable in elementary tlmc. We also ofrcr ext...
متن کاملComputation Paths Logic :
A new process logic is deened, called computation paths logic (CPL), which treats formulas and programs essentially alike. CPL is a pathwise extension of PDL, following the basic process logic of Harel, Kozen and Parikh, and is close in spirit to the logic R of Harel and Peleg. It enjoys most of the advantages of previous process logics, yet is decidable in elementary time. We also ooer extensi...
متن کاملAn Expressive Probabilistic Temporal Logic
This paper argues that a combined treatment of probabilities, time and actions is essential for an appropriate logical account of the notion of probability; and, based on this intuition, describes an expressive probabilistic temporal logic for reasoning about actions with uncertain outcomes. The logic is modal and higher-order : modalities annotated by actions are used to express possibility an...
متن کاملdesign of an analog fuzzy logic controller chip
fuzzy logic has been developed over the past three decades into a widely applied techinque in classification and control engineering. today fuzzy logic control is one of the most important applications of fuzzy set theory and specially fuzzy logic. there are two general approachs for using of fuzzy control, software and hardware. integrated circuits as a solution for hardware realization are us...
15 صفحه اولComputation in Logic and Logic in Computation
The theory of addition in the domains of natural (N), integer (Z), rational (Q), real (R) and complex (C) numbers is decidable; so is the theory of multiplication in all those domains. By Gödel’s Incompleteness Theorem the theory of addition and multiplication is undecidable in the domains of N, Z and Q; though Tarski proved that this theory is decidable in the domains of R and C. The theory of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 1999
ISSN: 0168-0072
DOI: 10.1016/s0168-0072(98)00038-4